A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
نویسندگان
چکیده
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problem appropriately. The lack of availability of such expertise is a significant bottleneck to the broader uptake of constraint technology in the real world. We present a new SATbased version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of the target problem. We show how domain-specific knowledge related to constraint redundancy can be exploited in a number of ways using the new algorithm. We highlight a number of advantages of our approach. Finally, we empirically demonstrate the algorithm and the effect of exploiting domain-specific knowledge.
منابع مشابه
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm for acquiring constraint networks from examples of solutions and non-solutions of a target problem. An ...
متن کاملIntegrating Constraint Satisfaction and Spatial Reasoning
Many problems in AI, including planning, logical reasoning and probabilistic inference, have been shown to reduce to (weighted) constraint satisfaction. While there are a number of approaches for solving such problems, the recent gains in efficiency of the satisfiability approach have made SAT solvers a popular choice. Modern propositional SAT solvers are efficient for a wide variety of problem...
متن کاملUsing CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld problems in planning, scheduling, and circuit diagnosis and synthesis. Our results show that incorporating CSP lookback techniques -especially the relatively new technique of relevance-bounded learning -renders easy many ...
متن کاملLearning from Failure in Constraint Satisfaction Search
Much work has been done on learning from failure in search to boost solving of combinatorial problems, such as clause-learning in boolean satisfiability (SAT), nogood and explanation-based learning, and constraint weighting in constraint satisfaction problems (CSPs), etc. Many of the top solvers in SAT use clause learning to good effect. A similar approach (nogood learning) has not had as large...
متن کاملReformulating Propositional Satissability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...
متن کامل